Conformant Planning via Symbolic Model Checking

Forward Conformant Planning via Symbolic Model Checking

Conformant planning is the problem of finding a sequence of actions that is guaranteed to achieve the goal for any possible initial state and nondeterministic behavior of the planning domain. In this paper we present a new algorithm for conformant planning, returning conformant plans of minimal length if the problem admits a solution, otherwise returning with failure. This work extends previous...

Conformant Planning via Symbolic Model Checking

We tackle the problem of planning in nondeterministic domains, by presenting a new approach to conformant planning. Conformant planning is the problem of nding a sequence of actions that is guaranteed to achieve the goal despite the nondeterminism of the domain. Our approach is based on the representation of the planning domain as a nite state automaton. We use Symbolic Model Checking technique...

Conformant planning via symbolic model checking and heuristic search

In this paper we tackle the problem of Conformant Planning: find a sequence of actions that guarantees goal achievement regardless of an uncertain initial condition and of nondeterministic action effects. Our approach, set in the framework of search in the belief space, is based on two main intuitions. First, symbolic model checking techniques, Binary Decision Diagrams in particular, can be use...

Conformant Planning via Model Checking

CONFORMANT PLANNING VIA MODEL CHECKING Cimatti

This report has been submitted forr publication outside of ITC and will probably be copyrighted if accepted for publication. It has been issued as a Technical Report forr early dissemination of its contents. In view of the transfert of copy right too the outside publisher, its distribution outside of ITC priorr to publication should be limited to peer communications and specificc requests. Afte...